Temporal logics for concurrent recursive programs: Satisfiability and model checking
نویسندگان
چکیده
منابع مشابه
Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking
We develop a general framework for the design of temporal logics for concurrent recursive programs. A program execution is modeled as a partial order with multiple nesting relations. To specify properties of executions, we consider any temporal logic whose modalities are definable in monadic second-order logic and that, in addition, allows PDL-like path expressions. This captures, in a unifying...
متن کاملModel Checking Concurrent Recursive Programs Using Temporal Logics
We consider two bounded versions of the model checking problem of a fixed temporal logic TL whose modalities are MSO-definable and which is specifying properties of multiply nested words, i.e., of runs of pushdown automata with multiple stacks. One of the problems asks, given a multi-stack system A, a temporal formula F from TL, and a bound k, whether all nested words ν which are accepted by A ...
متن کاملSMT-Based Model Checking for Recursive Programs
We present an SMT-based symbolic model checking algorithm for safety verification of recursive programs. The algorithm is modular and analyzes procedures individually. Unlike other SMT-based approaches, it maintains both overand under-approximations of procedure summaries. Under-approximations are used to analyze procedure calls without inlining. Over-approximations are used to block infeasible...
متن کاملModel-checking Timed Temporal Logics
In this paper, we present several timed extensions of temporal logics, that can be used for model-checking real-time systems. We give different formalisms and the corresponding decidability/complexity results. We also give intuition to explain these results.
متن کاملSatisfiability Modulo Recursive Programs
We present a semi-decision procedure for checking satisfiability of expressive correctness properties of recursive first-order functional programs. In our approach, both properties and programs are expressed in the same language, a subset of Scala. We implemented our procedure and integrated it with the Z3 SMT solver and the Scala compiler. Our procedure is sound for counterexamples and for pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Logic
سال: 2014
ISSN: 1570-8683
DOI: 10.1016/j.jal.2014.05.001